Vacuity in synthesis

نویسندگان

چکیده

Abstract In reactive synthesis, one begins with a temporal specification $$\varphi $$ φ , and automatically synthesizes system $$M$$ M such that $$M\models \varphi ⊧ . As many systems can satisfy given specification, it is natural to seek ways force the synthesis tool synthesize are of higher quality, in some well-defined sense. this article we focus on well-known measure way which satisfies its namely vacuity Our conjecture if synthesized M non-vacuously then likely be closer user’s intent, because more “meaningful” way. Narrowing gap between formal designer’s intent way, automatically, topic article. Specifically, propose bounded method for achieving goal. The notion as defined context model checking, however, not necessarily refined enough purpose synthesis. Hence, even when technically non-vacuous, there yet interesting (equivalently, less vacuous) systems, would like able them. To end, cope problem synthesizing non-vacuous possible set behaviours respect induce partial order transition systems. On theoretical side show examples specifications single maximal element (i.e., most system), equivalent elements, or number incomparable elements. We also infinite chains increasingly These results have implications how be. implemented new procedure our PARTY. For added capability based property conjunction universal existential LTL formulas.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vacuity in Testing

In recent years, we see a growing awareness to the importance of assessing the quality of specifications. In the context of model checking, this can be done by analyzing the effect of applying mutations to the specification or the system. If the system satisfies the mutated specification, we know that some elements of the specification do not play a role in its satisfaction, thus the specificat...

متن کامل

Regular Vacuity

The application of model-checking tools to complex systems involves a nontrivial step of modelling the system by a finite-state model and a translation of the desired properties into a formal specification. While a positive answer of the model checker guarantees that the model satisfies the specification, correctness of the modelling is not checked. Vacuity detection is a successful approach fo...

متن کامل

Inherent Vacuity in Lattice Automata

Vacuity checking is traditionally performed after model checking has terminated successfully. It ensures that all the elements of the specification have played a role in its satisfaction by the system. The need to check the quality of specifications is even more acute in property-based design, where the specification is the only input, serving as a basis to the development of the system. Inhere...

متن کامل

Extending Extended Vacuity

There has been a growing interest in detecting whether a logic specification holds in the system vacuously. For example, a specification ”every request is eventually followed by an acknowledgment” holds vacuously on those systems that never generate requests. In a recent paper, Armoni et al. have argued against previous definitions of vacuity, defined as sensitivity with respect to syntactic pe...

متن کامل

Temporal Antecedent Failure: Refining Vacuity

We re-examine vacuity in temporal logic model checking. We note two disturbing phenomena in recent results in this area. The first indicates that not all vacuities detected in practical applications are considered a problem by the system verifier. The second shows that vacuity detection for certain logics can be very complex and time consuming. This brings vacuity detection into an undesirable ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Formal Methods in System Design

سال: 2021

ISSN: ['1572-8102', '0925-9856']

DOI: https://doi.org/10.1007/s10703-021-00381-5